Graph Connectivity in Log Steps Using Label Propagation

نویسندگان

چکیده

The fastest deterministic algorithms for connected components take logarithmic time and perform superlinear work on a Parallel Random Access Machine (PRAM). These maintain spanning forest by merging compressing trees, which requires pointer-chasing operations that increase memory access latency are limited to shared-memory systems. Many of these PRAM also very complicated implement. Another popular method is “leader-contraction” where the challenge select constant fraction leaders adjacent non-leaders with high probability, but this can require adding more edges than were in original graph. Instead we investigate label propagation because it deterministic, easy implement, does not rely pointer-chasing. Label exchanges representative labels within component using simple graph traversal, inherently difficult complete sublinear number steps. We able overcome problems connectivity. introduce surprisingly framework undirected connectivity easily adaptable many computational models. It achieves convergence independently processors without increasing edge count. employ novel propagating directed alternating direction while performing minimum reduction vertex labels. present new PRAM, Stream, MapReduce. Given simple, [Formula: see text] vertices, edges, our approach takes O(m) each step, only prove path was conjectured Liu Tarjan (2019) steps or possibly Our experiments range graphs suggest convergence. leave proof as an open problem.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Label Propagation Using Amendable Clamping

Assigning several labels to digital data is becoming easier because we can perform it in a collaborative manner with Internet users. However, some suitable labels may be missed and may not be attached to the data leading to inaccuracies in classification. In this paper, we propose a novel graphbased multi-label classifier to support the multi-labeling task. The core process of our algorithm is ...

متن کامل

Identification of mild cognitive impairment disease using brain functional connectivity and graph analysis in fMRI data

Background: Early diagnosis of patients in the early stages of Alzheimer's, known as mild cognitive impairment, is of great importance in the treatment of this disease. If a patient can be diagnosed at this stage, it is possible to treat or delay Alzheimer's disease. Resting-state functional magnetic resonance imaging (fMRI) is very common in the process of diagnosing Alzheimer's disease. In th...

متن کامل

A Metric Learning Approach for Graph-based Label Propagation

The efficiency of graph-based semi-supervised algorithms depends on the graph of instances on which they are applied. The instances are often in a vectorial form before a graph linking them is built. The construction of the graph relies on a metric over the vectorial space that help define the weight of the connection between entities. The classic choice for this metric is usually a distance me...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Parallel Processing Letters

سال: 2021

ISSN: ['0129-6264', '1793-642X']

DOI: https://doi.org/10.1142/s0129626421500213